Successive matrix squaring algorithm for computing outer inverses

Full-rank representations of {2, 4}, {2, 3}-inverses and successive matrix squaring algorithm

We present the full-rank representations of {2, 4} and {2, 3}-inverses (with given rank as well as with prescribed range and null space) as particular cases of the full-rank representation of outer inverses. As a consequence, two applications of the successive matrix squaring (SMS) algorithm from [P.S. Stanimirović, D.S. Cvetković-Ilić, Successive matrix squaring algorithm for computing outer i...

Successive Matrix Squaring Algorithm for Computing the Generalized Inverse AT,S(2)

We investigate successive matrix squaring SMS algorithms for computing the generalized inverse A 2 T,S of a given matrix A ∈ C m×n .

Successive Matrix Squaring Algorithm for Computing the Generalized Inverse A 2 T , S

Gauss-Jordan elimination method for computing outer inverses

This paper deals with the algorithm for computing outer inverse with prescribed range and null space, based on the choice of an appropriate matrix G and Gauss–Jordan elimination of the augmented matrix [G | I]. The advantage of such algorithms is the fact that one can compute various generalized inverses using the same procedure, for different input matrices. In particular, we derive representa...

Three Novel Theorems for Applied Cryptography

With advancements in computing capabilities public key cryptosystems are going to be more complex yet vulnerable over the modern day‟s computer networks and associated security mechanism, especially those based on novel approaches of applied mathematics. This paper explores three novel theorems derived while studying and implementing RSA algorithm, one of the strongest public key cryptosystem. ...